On solving pseudomonotone equilibrium problems via two new extragradient-type methods under convex constraints

نویسندگان

چکیده

Abstract The primary objective of this study is to develop two new proximal-type algorithms for solving equilibrium problems in real Hilbert space. Both are analogous the well-known two-step extragradient algorithm variational inequality problem spaces. proposed iterative use a step size rule based on local bifunction information instead line search technique. Two weak convergence theorems both well-established by letting mild conditions. main results used solve fixed point and problems. Finally, we present several computational experiments demonstrate efficiency effectiveness algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coupling Extragradient Methods with Cq Methods for Equilibrium Points, Pseudomonotone Variational Inequalities and Fixed Points

In this paper, we suggest a hybrid method for finding a common element of the set of solution of an equilibrium problem, the set of solution of a pseudomonotone variational inequality problem and the set of common fixed points of an infinite family of nonexpansive mappings. The constructed iterative method combines two well-known methods: extragradient method and CQ method. We derive a necessar...

متن کامل

The extragradient-Armijo method for pseudomonotone equilibrium problems and strict pseudocontractions

* Correspondence: [email protected]. vn Department of Scientific Fundamentals, Posts and Telecommunications Institute of Technology, Hanoi, Vietnam Full list of author information is available at the end of the article Abstract In this article, we present a new iteration method for finding a common element of the set of fixed points of p strict pseudocontractions and the set of solutions of equili...

متن کامل

Iteratively Solving Linear Inverse Problems under General Convex Constraints

We consider linear inverse problems where the solution is assumed to fulfill some general homogeneous convex constraint. We develop an algorithm that amounts to a projected Landweber iteration and that provides and iterative approach to the solution of this inverse problem. For relatively moderate assumptions on the constraint we can always prove weak convergence of the iterative scheme. In cer...

متن کامل

Common solutions to pseudomonotone equilibrium problems

‎In this paper‎, ‎we propose two iterative methods for finding a common solution of a finite family of equilibrium problems ‎for pseudomonotone bifunctions‎. ‎The first is a parallel hybrid extragradient-cutting algorithm which is extended from the‎ ‎previously known one for variational inequalities to equilibrium problems‎. ‎The second is a new cyclic hybrid‎ ‎extragradient-cutting algorithm‎....

متن کامل

On Equilibrium Problems Involving Strongly Pseudomonotone Bifunctions

We study equilibrium problems with strongly pseudomonotone bifunctions in real Hilbert spaces. We show the existence of a unique solution. We then propose a generalized strongly convergent projection method for equilibrium problems with strongly pseudomonotone bifunctions. The proposed method uses only one projection without requiring Lipschitz continuity. Application to variational inequalitie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Demonstratio Mathematica

سال: 2022

ISSN: ['0420-1213', '2391-4661']

DOI: https://doi.org/10.1515/dema-2022-0025